The Dirichlet Problem for the Perturbed Elliptic Equation
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Dirichlet Problem for Singularly Perturbed Elliptic Equations
There has been much work on various singularly perturbed partial differential equations or systems. Such equations or systems depend on some small parameters ε > 0, solutions denoted as uε. There are at least two types of questions being investigated. The first type is to study possible behavior of uε as ε tends to zero. The second is to actually construct, by various methods, such solutions. I...
متن کاملExistence Results for a Dirichlet Quasilinear Elliptic Problem
In this paper, existence results of positive classical solutions for a class of second-order differential equations with the nonlinearity dependent on the derivative are established. The approach is based on variational methods.
متن کاملThe Dirichlet Problem for Nonuniformly Elliptic Equations
and repeated indices indicate summation from 1 to n. The functions a'(x, u, p), a(x, u, p) are defined in QX£ n + 1 . If furthermore for any ikf>0, the ratio of the maximum to minimum eigenvalues of [a(Xy u, p)] is bounded in ÛX( — M, M)XE, Qu is called uniformly elliptic. A solution of the Dirichlet problem Qu = Q, u—<f)(x) on <50 is a C(n)P\C(O) function u(x) satisfying Qu = 0 in £2 and agree...
متن کاملA Cascadic Algorithm for Nonlinearly Perturbed Elliptic Dirichlet Problems
In this paper we propose a cascadic algorithm for nonlinearly perturbed elliptic Dirichlet problems. The nonlinear equations arising from certain nite element discretizations are solved by Newton's method. The cascadic algorithm starts on a comparatively coarse grid where the number of unknowns is small enough to obtain an approximate solution within suu-ciently high precision without substanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8122108